Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 15 June 2020Accepted: 22 February 2021Published online: 14 2021KeywordsKaczmarz method, randomized algorithm, linear system, overdetermined underdetermined least squares problem, iterative inner-outer iteration, preconditioner, GMRES, flexible GMRESAMS Subject Headings65F08, 65F10, 65F50, 15A06Publication DataISSN (print): 1064-8275ISSN (online): 1095-7197Publisher: Society for Industrial and Applied MathematicsCODEN: sjoce3
منابع مشابه
A Flexible Inner-Outer Preconditioned GMRES Algorithm
We present a variant of the GMRES algorithm which allows changes in the precon-ditioning at every step. There are many possible applications of the new algorithm some of which are brieey discussed. In particular, a result of the exibility of the new variant is that any iterative method can be used as a preconditioner. For example, the standard GMRES algorithm itself can be used as a preconditio...
متن کاملConvergence of Inner-Iteration GMRES Methods for Least Squares Problems
We develop a general convergence theory for the generalized minimal residual method for least squares problems preconditioned with inner iterations. The inner iterations are performed by stationary iterative methods. We also present theoretical justifications for using specific inner iterations such as the Jacobi and SOR-type methods. The theory is improved particularly in the rankdeficient cas...
متن کاملSsor Preconditioned Inner-outer Flexible Gmres Method for Mlfmm Analysis of Scat- Tering of Open Objects
To efficiently solve large dense complex linear system arising from electric field integral equations (EFIE) formulation of electromagnetic scattering problems, the multilevel fast multipole method (MLFMM) is used to accelerate the matrix-vector product operations. The inner-outer flexible generalized minimum residual method (FGMRES) is combined with the symmetric successive overrelaxation (SSO...
متن کاملGmres-type Methods for Inconsistent Systems
Throughout this paper the integer l is defined by (1.3). Saad and Schulz [6, Proposition 2] show that when A is nonsingular and m ≥ l, the solution xm of the minimization problem (1.2) solves the linear system (1.1). The GMRES method is often implemented by first computing an orthogonal basis {vj} min{m,l} j=1 of the Krylov subspace Km(A, r0) by Arnoldi’s method; see Saad [7] or Saad and Schult...
متن کاملComparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2021
ISSN: ['1095-7197', '1064-8275']
DOI: https://doi.org/10.1137/20m1344937